Nonobtuse local tetrahedral refinements towards a polygonal face/interface

In this note we show how to generate and conformally refine nonobtuse tetrahedral meshes locally in the neighbourhood of a polygonal face or a polygonal interior interface of a three-dimensional domain. The technique proposed can be used for example for problems with boundary and/or interior layers, and for interface problems

Local nonobtuse tetrahedral refinements around an edge

In this note we show how to generate and conformly refine nonobtuse tetrahedral meshes locally around and towards an edge so that all dihedral angles of all resulting tetrahedra remain nonobtuse. The proposed technique can be used e.g. for a numerical treatment of solution singularities, and also for various mesh adaptivity procedures, near the reentrant corners of cylindric-type 3D domains

On Conforming Tetrahedralisations of Prismatic Partitions

We present an algorithm for conform (face-to-face) subdividing prismatic partitions into tetrahedra. This algorithm can be used in the finite element calculations and analysis

On global and local mesh refinements by a generalized conforming bisection algorithm

We examine a generalized conforming bisection (GCB-)algorithm which allows both global and local nested refinements of the triangulations without generating hanging nodes. It is based on the notion of a mesh density function which prescribes where and how much to refine the mesh. Some regularity properties of generated sequences of refined triangulations are proved. Several numerical tests demonstrate the efficiency of the proposed bisection algorithm. It is also shown how to modify the GCB-algorithm in order to generate anisotropic meshes with high aspect ratios

A Geometric Toolbox for Tetrahedral Finite Element Partitions

In this work we present a survey of some geometric results on tetrahedral partitions and their refinements in a unified manner. They can be used for mesh generation and adaptivity in practical calculations by the finite element method (FEM), and also in theoretical finite element (FE) analysis. Special emphasis is laid on the correspondence between relevant results and terminology used in FE computations, and those established in the area of discrete and computational geometry (DCG)

The maximum angle condition is not necessary for convergence of the finite element method

We show that the famous maximum angle condition in the finite element analysis is not necessary to achieve the optimal convergence rate when simplicial finite elements are used to solve elliptic problems. This condition is only sufficient. In fact, finite element approximations may converge even though some dihedral angles of simplicial elements tend to π

Fast and reliable pricing of American options with local volatility

We present globally convergent multigrid methods for the nonsymmetric obstacle problems as arising from the discretization of Black—Scholes models of American options with local volatilities and discrete data. No tuning or regularization parameters occur. Our approach relies on symmetrization by transformation and data recovery by superconvergence

Quadruple-peaked spectral line profiles as a tool to constrain gravitational potential of shell galaxies

Stellar shells observed in many giant elliptical and lenticular as well as a few spiral and dwarf galaxies, presumably result from galaxy mergers. Line-of-sight velocity distributions of the shells could, in principle, if measured with a sufficiently high S/N, constitute one of methods to constrain the gravitational potential of the host galaxy. Merrifield & Kuijken (1998) predicted a double-peaked line profile for stationary shells resulting from a nearly radial minor merger. In this paper, we aim at extending their analysis to a more realistic case of expanding shells, inherent to the merging process, whereas we assume the same type of merger and the same orbital geometry. We use analytical approach as well as test particle simulations to predict the line-of-sight velocity profile across the shell structure. Simulated line profiles are convolved with spectral PSFs to estimate the peak detectability. The resulting line-of-sight velocity distributions are more complex than previously predicted due to non-zero phase velocity of the shells. In principle, each of the Merrifield & Kuijken (1998) peaks splits into two, giving a quadruple-peaked line profile, which allows more precise determination of the potential of the host galaxy and, moreover, contains additional information. We find simple analytical expressions that connect the positions of the four peaks of the line profile and the mass distribution of the galaxy, namely the circular velocity at the given shell radius and the propagation velocity of the shell. The analytical expressions were applied to a test-particle simulation of a radial minor merger and the potential of the simulated host galaxy was successfully recovered. The shell kinematics can thus become an independent tool to determine the content and distribution of the dark matter in shell galaxies, up to ~100 kpc from the center of the host galaxy.Comment: 15 pages, 16 figures | v2: accepted for publication in A&A, minor language correction